On the Hankel-norm Approximation of Upper-triangular Operators and Matrices

نویسنده

  • P. Dewilde
چکیده

A matrix T = Tij ∞ i,j=−∞, which consists of a doubly indexed collection fT ijg of operators, is said to be upper when Tij = 0 for i > j. We consider the case where the Tij are finite matrices and the operator T is bounded, and such that the Tij are generated by a strictly stable, non-stationary but linear dynamical state space model or colligation. For such a model, we consider model reduction, which is a procedure to obtain optimal approximating models of lower system order. Our approximation theory uses a norm which generalizes the Hankel norm of classical stationary linear dynamical systems. We obtain a parametrization of all solutions of the model order reduction problem in terms of a fractional representation based on a non-stationary J-unitary operator constructed from the data. In addition, we derive a state space model for the so-called maximum entropy approximant. In the stationary case, the problem was solved by Adamyan, Arov and Krein in their paper on Schur-Takagi interpolation. Our approach extends that theory to cover general, non-Toeplitz upper operators.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Parametrization of Hankel-norm approximants of time-varying systems

The classical time-invariant Hankel-norm approximation problem is generalized to the time-varying context. The input-output operator of a time-varying bounded causal linear system acting in discrete time may be specified as a bounded upper-triangular operator T with block matrix entries Tij. For such an operator T, we will define the Hankel norm as a generalization of the time-invariant Hankel ...

متن کامل

On Low-Complexity Approximation of Matrices

The operation ‘multiplication of a vector by a matrix’ can be represented by a computational scheme (or model) that acts on the entries of the vector sequentially. The number of intermediate quantities (‘states’) that are needed in the computations is a measure of the complexity of the model. If that complexity is low, then not only multiplication, but also other operations such as inversion, c...

متن کامل

Joint and Generalized Spectral Radius of Upper Triangular Matrices with Entries in a Unital Banach Algebra

In this paper, we discuss some properties of joint spectral {radius(jsr)} and  generalized spectral radius(gsr)  for a finite set of upper triangular matrices with entries in a Banach algebra and represent relation between geometric and joint/generalized spectral radius. Some of these are in scalar matrices, but  some are different. For example for a bounded set of scalar matrices,$Sigma$, $r_*...

متن کامل

Block Factorization of Hankel Matrices and Euclidean Algorithm

It is shown that a real Hankel matrix admits an approximate block diagonalization in which the successive transformation matrices are upper triangular Toeplitz matrices. The structure of this factorization was first fully discussed in [1]. This approach is extended to obtain the quotients and the remainders appearing in the Euclidean algorithm applied to two polynomials u(x) and v(x) of degree ...

متن کامل

On the fine spectrum of generalized upper triangular double-band matrices $Delta^{uv}$ over the sequence spaces $c_o$ and $c$

The main purpose of this paper is to determine the fine spectrum of the generalized upper triangular double-band matrices uv over the sequence spaces c0 and c. These results are more general than the spectrum of upper triangular double-band matrices of Karakaya and Altun[V. Karakaya, M. Altun, Fine spectra of upper triangular doubleband matrices, Journal of Computational and Applied Mathematics...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1993